Adaptive Landmark Selection when Routing in Time-Depended Network
نویسندگان
چکیده
Àííîòàöèÿ Ðàññìîòðåíà çàäà÷à Time-Dependent Shortest-Path, ðàñøèðåíèå çàäà÷è î êðàò÷àéøåì ïóòè â ãðàôå, êîãäà âåñ äóãè ãðàôà ÿâëÿåòñÿ ôóíêöèåé îò âðåìåíè îòïðàâëåíèÿ èç íà÷àëüíîé âåðøèíû ýòîé äóãè. Òàêîé ãðàô íàçûâàþò íåñòàöèîíàðíîé ñåòüþ. Ïðåäëîæåíà ìîäèôèêàöèÿ àëãîðèòìà ALT (A* with Landmarks & Triangle), îñóùåñòâëÿþùàÿ öåëåíàïðàâëåííûé ïîèñê ïóòè â íåñòàöèîíàðíîé ñåòè ïî îðèåíòèðàì. Îðèåíòèðû óñòàíàâëèâàþòñÿ ñ ïîìîùüþ àäàïòèâíîé ñòðàòåãèè. Ïðèâåäåíû èòîãè ýêñïåðèìåíòîâ. Êëþ÷åâûå ñëîâà: ìàðøðóòèçàöèÿ, êðàò÷àéøèé ïóòü, àëãîðèòì ALT, îðèåíòèðû, ýâðèñòèêà, ãðàô áîëüøîé ðàçìåðíîñòè.
منابع مشابه
Congestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملLeach Routing Algorithm Optimization through Imperialist Approach
Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...
متن کاملBeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملMMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing
Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016